Parallel enumeration of degree sequences of simple graphs II
نویسندگان
چکیده
In the paper we report on the parallel enumeration of the degree sequences (their number is denoted by G(n)) and zerofree degree sequences (their number is denoted by (Gz(n)) of simple graphs on n = 30 and n = 31 vertices. Among others we obtained that the number of zerofree degree sequences of graphs on n = 30 vertices is Gz(30) = 5 876 236 938 019 300 and on n = 31 vertices is Gz(31) = 22 974 847 474 172 374. Due to Corollary 21 in [52] these results give the number of degree sequences of simple graphs on 30 and 31 vertices.
منابع مشابه
Structural Synthesis of Mechanically Constrained Single Loop 6-Bar Chain
In the present work, graphical enumeration technique is applied for structural synthesis of mechanically constrained planar parallel robot formed by single loop 6bar chain or two 3R chains. Two RR chains are added to the considered system to mechanically constraint the movement of its end-effector. Structural code has been proposed as a new systematic methodology to detect isomorphic graphs. Th...
متن کاملAsymptotic enumeration by degree sequence of graphs with degress o(n1/2)
We determine the asymptotic number of labelled graphs with a given degree sequence for the case where the maximum degree is o(|E(G)|). The previously best enumeration, by the first author, required maximum degree o(|E(G)|). In particular, if k = o(n), the number of regular graphs of degree k and order n is asymptotically (nk)! (nk/2)! 2nk/2(k!)n exp ( − 2 − 1 4 − k 3 12n + O(k/n) ) . Under slig...
متن کاملAsymptotic Enumeration by Degree Sequence of Graphs of High Degree
We consider the estimation of the number of labelled simple graphs with degree sequence d1, d2, . . . , dn by using an n-dimensional Cauchy integral. For suffiently small and any c > 2 3 , an asymptotic formula is obtained when |di − d| < n for all i and d = d(n) satisfies min{d, n − d − 1} ≥ cn/ log n as n → ∞. These conditions include the degree sequences of almost all graphs, so our result g...
متن کاملAsymptotic enumeration of sparse 2-connected graphs
We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on n vertices and m edges, provided that m−n→∞ and m = O(n logn) as n→∞. This is the entire range of m not covered by previous results. The proof involves determining properties of the core and kernel of random graphs with minimum degree at least 2. The case of 2-edge-connectedness is treated similarly. We...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014